Blocksequences of k-local Words

On k-colored Motzkin words

Longest alternating subsequences of k-ary words

Recently, Stanley [Longest alternating subsequences of permutations, preprint, arXiv/0511419v1] studied the length of the longest alternating subsequence of a permutation in the symmetric group,where a sequencea, b, c, d, . . . isalternating ifa >bd < · · ·. In this paper, we extend this result to the case of k-ary words. More precisely, we find an explicit formula for the generating functio...

A Local Balance Property of Episturmian Words

We prove that episturmian words and Arnoux-Rauzy sequences can be characterized using a local balance property. We also give a new characterization of epistandard words.

Efficient Searching Top-k Semantic Similar Words

Measuring the semantic meaning between words is an important issue because it is the basis for many applications, such as word sense disambiguation, document summarization, and so forth. Although it has been explored for several decades, most of the studies focus on improving the effectiveness of the problem, i.e., precision and recall. In this paper, we propose to address the efficiency issue,...

Restricted k-ary words and functional equations

We present an algorithm for finding a system of recurrence relations for the number of k-ary words of length n that satisfy a certain set of conditions. A rewriting of these relations automatically gives a system of functional equations satisfied by the multivariate generating function that counts k-ary words by their length and the indices of the corresponding recurrence relations. We propose ...